By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 32, Issue 1, pp. 1-280

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds

Ran Canetti, Joe Kilian, Erez Petrank, and Alon Rosen

pp. 1-47

BibTeX  Abstract Full Text:  PDF

The Nonstochastic Multiarmed Bandit Problem

Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, and Robert E. Schapire

pp. 48-77

BibTeX  Abstract Full Text:  PDF

A Virtually Synchronous Group Multicast Algorithm for WANs: Formal Approach

Idit Keidar and Roger Khazan

pp. 78-130

BibTeX  Abstract Full Text:  PDF

An Approximate L1-Difference Algorithm for Massive Data Streams

Joan Feigenbaum, Sampath Kannan, Martin J. Strauss, and Mahesh Viswanathan

pp. 131-151

BibTeX  Abstract Full Text:  PDF

Limit Laws for Sums of Functions of Subtrees of Random Binary Search Trees

Luc Devroye

pp. 152-171

BibTeX  Abstract Full Text:  PDF

Approximating theDomatic Number

Uriel Feige, Magnús M. Halldórsson, Guy Kortsarz, and Aravind Srinivasan

pp. 172-195

BibTeX  Abstract Full Text:  PDF

Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time

Etienne Grandjean and Thomas Schwentick

pp. 196-230

BibTeX  Abstract Full Text:  PDF

Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas

Guy Even, Sudipto Guha, and Baruch Schieber

pp. 231-252

BibTeX  Abstract Full Text:  PDF

Computational Complexity of Compaction to Reflexive Cycles

Narayan Vikas

pp. 253-280

BibTeX  Abstract Full Text:  PDF